Intransitive Dice

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intransitive Trees

We study the class of trees T on the set [1, 2, ..., n] such that for any 11i<j<kn the pairs [i, j] and [ j, k] cannot both be edges in T. We derive a formula for the number of such trees. We also give a functional equation and a differential equation for the generating function. We mention some additional combinatorial interpretations of these numbers. 1997 Academic Press 1. MAIN THEOREMS Defi...

متن کامل

Dynamic Intransitive Noninterference

Existing noninterference frameworks for reasoning about system security assume a fixed configuration of domains governed by a security policy that does not change over time. A static security policy, however, cannot express the domain interactions present in many modern system designs, which allow users to configure the set of active domains at runtime. In this paper, we generalize Rushby’s fra...

متن کامل

Tied dice

A generalized die is a list (x1; :::; xn) of integers. For integers n 1, a b and s let D(n; a; b; s) be the set of all dice with a x1 ::: xn b and P xi = s. Two dice X and Y are tied if the number of pairs (i; j) with xi < yj equals the number of pairs (i; j) with xi > yj . We prove the following: with one exception (unique up to isomorphism), if X 6= Y 2 D(n; a; b; s) are tied dice neither of ...

متن کامل

Dice graphs

For integers n 1, a b and s let D(n; a; b; s) be the set of all lists of integers (x1; :::; xn) with a x1 ::: xn b and P xi = s. There is a graph G(n; a; b; s) with vertex-set D(n; a; b; s) in which two vertices are adjacent if one is stronger than the other in a natural dice game. In The prevalence of “paradoxical” dice [Bull. Inst. Combin. Appl. 45 (2005), 70-76] the dice which are isolated v...

متن کامل

What Is Intransitive Noninterference?

The term “intransitive noninterference” refers to the information flow properties required of systems like downgraders, in which it may be legitimate for information to flow indirectly between two users but not directly. We examine the usual definition of this property in terms of a modified purge function, and show that this is a distinctly weaker property than an alternative we derive from co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics Magazine

سال: 2016

ISSN: 0025-570X,1930-0980

DOI: 10.4169/math.mag.89.2.133